981![A Distributed Algorithm for Large-Scale Generalized Matching Faraz Makari Manshadi Max-Planck-Institut fur ¨ Informatik A Distributed Algorithm for Large-Scale Generalized Matching Faraz Makari Manshadi Max-Planck-Institut fur ¨ Informatik](https://www.pdfsearch.io/img/92d4f29e8c735222b59817db203fd1e1.jpg) | Add to Reading ListSource URL: www.vldb.orgLanguage: English - Date: 2013-08-01 05:49:52
|
---|
982![Solutions to Homework Four CSE[removed]Algorithm A has running time TA (n) = 5TA (n/2) + O(n), Solutions to Homework Four CSE[removed]Algorithm A has running time TA (n) = 5TA (n/2) + O(n),](https://www.pdfsearch.io/img/43b3dc46f0c46b4cdd7814d76f533102.jpg) | Add to Reading ListSource URL: cseweb.ucsd.eduLanguage: English - Date: 2014-10-31 00:07:52
|
---|
983![(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ (Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗](https://www.pdfsearch.io/img/ebdbddda553a7ba40aa8edc7ab183ccc.jpg) | Add to Reading ListSource URL: groups.csail.mit.eduLanguage: English - Date: 2014-10-03 15:18:39
|
---|
984![CS 61B Reader #2 Data Structures (Into Java) (Fifth Edition) Paul N. Hilfinger University of California, Berkeley CS 61B Reader #2 Data Structures (Into Java) (Fifth Edition) Paul N. Hilfinger University of California, Berkeley](https://www.pdfsearch.io/img/78ff964c940f064e8fad8c0ad20ec194.jpg) | Add to Reading ListSource URL: inst.eecs.berkeley.eduLanguage: English - Date: 2008-01-28 16:05:21
|
---|
985![PS YC HOLOGICA L SC IENCE Research Article How Many Variables Can Humans Process? PS YC HOLOGICA L SC IENCE Research Article How Many Variables Can Humans Process?](https://www.pdfsearch.io/img/a82797a117fef33d6669b3bacbc84bb0.jpg) | Add to Reading ListSource URL: www.psychologicalscience.orgLanguage: English - Date: 2005-04-05 11:19:44
|
---|
986![COCOON 2012 The 18th Annual International Computing and Combinatorics Conference[removed]August 2012, Sydney, Australia. Original research papers in the areas of algorithms, theory of computation, computational complexity, COCOON 2012 The 18th Annual International Computing and Combinatorics Conference[removed]August 2012, Sydney, Australia. Original research papers in the areas of algorithms, theory of computation, computational complexity,](https://www.pdfsearch.io/img/c8f39a9a04588c0935a8d6bf0902beef.jpg) | Add to Reading ListSource URL: cocoon.it.usyd.edu.auLanguage: English - Date: 2011-10-31 20:39:26
|
---|
987![On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel.](https://www.pdfsearch.io/img/5225e793d362b834b12d71f34c9b7855.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.ilLanguage: English - Date: 2014-06-22 06:25:22
|
---|
988![Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve Ilya Baran [removed] Erik D. Demaine Optimal Adaptive Algorithms for Finding the Nearest and Farthest Point on a Parametric Black-Box Curve Ilya Baran [removed] Erik D. Demaine](https://www.pdfsearch.io/img/61e0afba0476fb87fa9b0e88500d2f51.jpg) | Add to Reading ListSource URL: www.mit.eduLanguage: English - Date: 2004-06-07 21:08:09
|
---|
989![Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs∗ Jingjin Yu Steven M. LaValle Department of Electrical and Computer Engineering Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs∗ Jingjin Yu Steven M. LaValle Department of Electrical and Computer Engineering](https://www.pdfsearch.io/img/c2ba1d87a62ab6a8c0eb6739f33986f1.jpg) | Add to Reading ListSource URL: msl.cs.uiuc.eduLanguage: English - Date: 2014-02-07 08:36:04
|
---|
990![How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei1 and Nina Narodytska2 and Toby Walsh3 Abstract. We study the computational complexity of controlling the result of an election by breaking ties stra](https://www.pdfsearch.io/img/74d770146616759b673fcdc9ebd5768c.jpg) | Add to Reading ListSource URL: www.nickmattei.netLanguage: English - Date: 2014-12-04 03:20:52
|
---|